package com.codechen.niuketop;

public class NC65 {


    public int Fibonacci(int n) {

        /*final int MOD = 1000000007;*/
        if (n < 2) {
            return n;
        }
        int[] dp =  new int[n+1];
        dp[0] = 0;
        dp[1] = 1;

        for (int i = 2; i <= n; ++i) {
//            dp[i] = (dp[i -1] +dp[i-2]) % MOD;
            dp[i] = (dp[i -1] +dp[i-2]);
        }

        return dp[n];
    }

}
